On the Complexity of Halfspace Volume Queries
نویسندگان
چکیده
Given a polyhedron P in R with n vertices, a halfspace volume query asks for the volume of P ∩H for a given halfspace H. We show that, for d ≥ 3, such queries can require Ω(n) operations even if the polyhedron P is convex and can be preprocessed arbitrarily.
منابع مشابه
Testing ±1-Weight Halfspaces
We consider the problem of testing whether a Boolean function f : {−1, 1} → {−1, 1} is a±1-weight halfspace, i.e. a function of the form f(x) = sgn(w1x1+w2x2+· · ·+wnxn) where the weightswi take values in {−1, 1}. We show that the complexity of this problem is markedly different from the problem of testing whether f is a general halfspace with arbitrary weights. While the latter can be done wit...
متن کاملSpace-Time Tradeoffs for Emptiness Queries
We develop the rst nontrivial lower bounds on the complexity of online hyperplane and halfspace emptiness queries. Our lower bounds apply to a general class of geometric range query data structures called partition graphs. Informally, a partition graph is a directed acyclic graph that describes a recursive decomposition of space. We show that any partition graph that supports hyperplane emptine...
متن کاملThe Impact of the Objective Complexity and Product of Work Task on Interactive Information Searching Behavior
Background and Aim: this study aimed to explore the impact of objective complexity and Product of work task on user's interactive information searching behavior. Method: The research population consisted of MSc students of Ferdowsi university of Mashhad enrolled in 2012-13 academic year. In 3 stages of sampling (random stratified, quota, and voluntary sampling), 30 cases were selected. Each of ...
متن کاملAdaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces
We give a poly(logn, 1/ε)-query adaptive algorithm for testing whether an unknown Boolean function f : {−1, 1}n → {−1, 1}, which is promised to be a halfspace, is monotone versus ε-far from monotone. Since non-adaptive algorithms are known to require almost Ω(n) queries to test whether an unknown halfspace is monotone versus far from monotone, this shows that adaptivity enables an exponential i...
متن کاملCryptanalysis of some first round CAESAR candidates
ΑΕS _ CMCCv₁, ΑVΑLΑNCHEv₁, CLΟCv₁, and SILCv₁ are four candidates of the first round of CAESAR. CLΟCv₁ is presented in FSE 2014 and SILCv₁ is designed upon it with the aim of optimizing the hardware implementation cost. In this paper, structural weaknesses of these candidates are studied. We present distinguishing attacks against ΑES _ CMCCv₁ with the complexity of two queries and the success ...
متن کامل